منابع مشابه
Generating the Nine-Point Graphs
A program has been written which recently generated all the (unlabelled) nine-point graphs. Written in MACRO-10 assembly language and run on a 165K PDP10, it generates the complete set of 274,668 graphs in less than six hours. The algorithm on which this program is based is discussed with an emphasis on coding of graphs and various programming techniques designed to save space and time during e...
متن کاملThe Smallest Cubic Graphs of Girth Nine
We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3, 9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 ver...
متن کاملThe Arbelos and Nine-Point Circles
We construct some new Archimedean circles in an arbelos in connection with the nine-point circles of some appropriate triangles. We also construct two new pairs of Archimedes circles analogous to those of Frank Power, and one pair of Archimedean circles related to the tangents of the arbelos.
متن کاملNine Tools for Generating Harmonious Colour Schemes
We survey a number of tools that have been developed for generating sets of colours according to commonly accepted rules for colour harmony. Informal manual techniques for generating harmonious sets of colours have been known and used for at least a century. Although superficially simple, they have not been precise techniques, as pigment-based and dye-based colouring techniques are not suscepti...
متن کاملGenerating weakly triangulated graphs
We show that a graph is weakly triangulated, or weakly chordal, if and only if it can be generated by starting with a graph with no edges, and repeatedly adding an edge, so that the new edge is not the middle edge of any chordless path with four vertices. This is a corollary of results due to Sritharan and Spinrad, and Hayward, Hoo ang and Maaray, and a natural analogue of a theorem due to Fulk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1974
ISSN: 0025-5718
DOI: 10.2307/2005705